APPROXIMATE GEOMETRIC REGULARITIES

Approximate Geometric Regularities

Current reverse engineering systems are able to generate simple valid boundary representation (B-rep) models from 3D range data. Such models suffer from various inaccuracies caused by noise in the input data and algorithms. Reverse engineered geometric models may be beautified by finding approximate geometric regularities in such a model, and imposing a suitable subset of them on the model by u...

Implementing approximate regularities

K e y w o r d s A p p r o x i m a t e regularities, Approximate period, Approximate cover, Approximate seed, Hamming distance, Edit distance, Weighted edit distance, Smallest distance approximation, Restricted smallest distance approximation. 1. I N T R O D U C T I O N Find ing regularities in s t r ings is useful in a wide a rea of app l i ca t ions which involve s t r ing man ipu la t ions , ...

The Generalized Approximate Regularities in Strings

We concentrate on the generalized string regularities and study the minimum approximate λ-cover problem and the minimum approximate λ-seed problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover (resp. seed) problem is to find a set of λ substrings each of equal length that covers x (resp. a superstring of x) with the minimum error, under a variety of...

Finding Approximate Shape Regularities for Reverse Engineering

Current reverse engineering systems can generate boundary representation (B-rep) models from 3D range data. Such models suffer from inaccuracies caused by noise in the input data and algorithms. The quality of reverse engineered geometric models can be improved by finding candidate shape regularities in such a model, and constraining the model to meet a suitable subset of them, in a post-proces...

On Approximate Geometric k-Clustering